منابع مشابه
A Constant Update Time Finger Search Tree
Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key was O( 1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Ko...
متن کاملConstant Time Generation of Free Trees
An algorithm of Beyer and Hedetniemi for generating unlabeled rooted trees is extended to generate unlabeled free trees. Abstract An algorithm of Beyer and Hedetniemi for generating unlabeled rooted trees is extended to generate unlabeled free trees. “The Beyer-Hedetniemi technique is refined to produce only one member of each equivalence class of rooted trees under isomorphism of the underlyin...
متن کاملFinding frequent items over sliding windows with constant update time
a r t i c l e i n f o a b s t r a c t In this paper, we consider the problem of finding-approximate frequent items over a sliding window of size N. A recent work by Lee and Ting (2006) [7] solves the problem by giving an algorithm that supports O (1) query and update time, and uses O (1) space. Their query time and memory usage are essentially optimal, but the update time is not. We give a new ...
متن کاملConstant Time Generation of Trees with Degree Bounds
Given a number n of vertices, a lower bound d on the diameter, and a capacity function ∆(k) ≥ 2, k = 0, 1, . . . , ⌊n/2⌋, we consider the problem of enumerating all unrooted trees T with exactly n vertices and a diameter at least d such that the degree of each vertex with distance k from the center of T is at most ∆(k). We give an algorithm that generates all such trees without duplication in O...
متن کاملConstant Time Generation of Trees with Specified Diameter
Many algorithms to generate all trees with n vertices without repetition are already known. The best algorithm runs in time proportional to the number of trees. However, the time needed to generate each tree may not be bounded by a constant, even though it is “on average”. In this paper we give a simple algorithm to generate all trees with exactly n vertices and diameter d, without repetition. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2019
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-019-00335-9